The Word Problem for Finitely Presented Quandles is Undecidable
نویسندگان
چکیده
This work presents an algorithmic reduction of the word problem for recursively presented groups to the word problem for recursively presented quandles. The faithfulness of the reduction follows from the conjugation quandle construction on groups. It follows that the word problem for recursively presented quandles is not effectively computable, in general. This article also demonstrates that a recursively presented quandle can be encoded as a recursively presented rack. Hence the word problem for recursively presented racks is also not effectively computable.
منابع مشابه
FDT is Undecidable for Finitely Presented Monoids with Solvable Word Problems
Exploiting a new technique for proving undecidability results developed by A. Sattler-Klein in her doctoral dissertation (1996) it is shown that it is undecidable in general whether or not a nitely presented monoid with a solvable word problem has nite derivation type (FDT). This improves upon the undecidability result of R. Cremanns and F. Otto (1996), which was based on the undecidability of ...
متن کاملSome Undecidable Problems in Group Theory
In this paper we obtain general results for undecidable first order decision problems about groups (that is, problems about elements in a particular group, such as the word and conjugacy problems). We shall describe a class ii of such decision problems and a construction A such that if P is a problem in Q, then A(P) will be a finitely presented group in which P is recursively undecidable. This ...
متن کاملTiling Problems on Baumslag-Solitar groups
Wang tilings are colorings of the Euclidean plane that respect some local constraints. They can be viewed both as dynamical systems and computational models, but they were first introduced by Hao Wang to study decision problems on some classes of logical formulas [18]. The concept of Wang tiles may be generalized to define tilings on the Cayley graph of a finitely generated group. The domino pr...
متن کاملThe Groups of Richard Thompson and Complexity
We prove new results about the remarkable infinite simple groups introduced by Richard Thompson in the 1960s. We give a faithful representation in the Cuntz C⋆algebra. For the finitely presented simple group V we show that the word-length and the table size satisfy an n log n relation. We show that the word problem of V belongs to the parallel complexity class AC1 (a subclass of P), whereas the...
متن کاملDecidability and Independence of Conjugacy Problems in Finitely Presented Monoids
There have been several attempts to extend the notion of conjugacy from groups to monoids. The aim of this paper is study the decidability and independence of conjugacy problems for three of these notions (which we will denote by ∼p, ∼o, and ∼c) in certain classes of finitely presented monoids. We will show that in the class of polycyclic monoids, p-conjugacy is “almost” transitive, ∼c is stric...
متن کامل